Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars
نویسندگان
چکیده
منابع مشابه
Research on the Top-Down Parsing Method for Context-Sensitive Graph Grammars
The parsing problem is one of the key problems of graph grammars. The typical parsing algorithm uses the bottom-up method. The time-complexity of this method is high, and it is difficult to apply. In order to reduce the time-complexity, this paper uses the top-down method for parsing. This method avoids the subgraph isomorphism judgment and selects the productions specifically, so that the time...
متن کاملTop-Down Nearly-Context-Sensitive Parsing
We present a new syntactic parser that works left-to-right and top down, thus maintaining a fully-connected parse tree for a few alternative parse hypotheses. All of the commonly used statistical parsers use context-free dynamic programming algorithms and as such work bottom up on the entire sentence. Thus they only find a complete fully connected parse at the very end. In contrast, both subjec...
متن کاملAttributed Context-Sensitive Graph Grammars
The paper introduces a concept of attributed context-sensitive graph grammars. The graph grammars are a graphical generalization of the textual grammars and can thus be used to specify the syntax of graphical programming or modeling languages. The attributed graph grammars extend the basic graph grammars with definitions of attributes and the associated attribute evaluation rules. By analogy to...
متن کاملTop-Down Parsing with Parsing Contexts A Simple Approach to Context-Sensitive Parsing
The domain of context-free languages has been extensively explored and there exist numerous techniques for parsing (all or a subset of) context-free languages. Unfortunately, some programming languages are not context-free. Using standard context-free parsing techniques to parse a context-sensitive programming language poses a considerable challenge. Implementors of programming language parsers...
متن کاملConstructing Confluent Context-sensitive Graph Grammars from Non-confluent Productions for Parsing Efficiency
The efficient parsing algorithms are usually confined to confluent graph grammars in context-sensitive formalisms, whereas the confluence condition is not frequently met by graph grammars in practical applications. This paper, based on the Reserved Graph Grammar (RGG) formalism, proposes an extended formalism XRGG which allows imposing constraints characterizing application situations on graph ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2015
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0142776